A Ramsey theorem for countable homogeneous directed graphs
نویسنده
چکیده
Let T be a ,nite set of ,nite tournaments and HT the countable homogeneous directed graph which does not embed any of the tournaments in T. We will completely describe the vertex partition property HT. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Complexity Classification in Infinite-Domain Constraint Satisfaction
appeared in the proceedings of ICDT’10. [44] M. Bodirsky and J. Nešetřil. Constraint satisfaction with countable homogeneous templates. In Proceedings of CSL, pages 44–57, Vienna, 2003. [45] M. Bodirsky and J. Nešetřil. Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation, 16(3):359–373, 2006. [46] M. Bodirsky and D. Piguet. Finite trees are Ramsey with...
متن کاملOn partitions of hereditary properties of graphs
In this paper a concept Q-Ramsey Class of graphs is introduced, where Q is a class of bipartite graphs. It is a generalization of wellknown concept of Ramsey Class of graphs. Some Q-Ramsey Classes of graphs are presented (Theorem 1 and 2). We proved that T 2, the class of all outerplanar graphs, is not D1-Ramsey Class (Theorem 3). This results leads us to the concept of acyclic reducible bounds...
متن کاملAmenability and unique ergodicity of automorphism groups of countable homogeneous directed graphs
We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable (in their natural topologies). For those which are amenable, we determine whether they are uniquely ergodic, leaving unsettled precisely one case (the “semi-ge...
متن کاملRamsey Precompact Expansions of Homogeneous Directed Graphs
In 2005, Kechris, Pestov and Todorčević provided a powerful tool to compute an invariant of topological groups known as the universal minimal flow, immediately leading to an explicit representation of this invariant in many concrete cases. More recently, the framework was generalized allowing for further applications, and the purpose of this paper is to apply these new methods in the context of...
متن کاملThe size Ramsey number of a directed path
Given a graph H, the size Ramsey number re(H, q) is the minimal number m for which there is a graph G with m edges such that every q-coloring of G contains a monochromatic copy of H. We study the size Ramsey number of the directed path of length n in oriented graphs, where no antiparallel edges are allowed. We give nearly tight bounds for every fixed number of colors, showing that for every q ≥...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 253 شماره
صفحات -
تاریخ انتشار 2002